Graph colouring approaches for a satellite range scheduling problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولLocal Search for the Colouring Graph Problem. A Computational Study
The Graph Colouring Problem (GCP) is a well known -hard problem with many theoretical and practical applications. In this paper we introduce a new local search algorithm based on a very large scale neighbourhood. We provide an extensive numerical comparison between this method and several other local search techniques considering also the embedding of the local search into more complex schemes ...
متن کاملAMultilevel Approach to the Graph Colouring Problem
Wemotivate, derive and implement a multilevel approach to the graph colouring problem. The resulting algorithm progressively coarsens the problem, initialises a colouring and then employs either Culberson’s iterated greedy algorithm or tabu search to refine the solution on each of the coarsened problems in reverse order. Tests on a large suite of problem instances indicate that for low-density ...
متن کاملQuantum inspired cuckoo search algorithm for graph colouring problem
The graph coloring problem (GCP) is one of the most interesting, studied and difficult combinatorial optimization problems. That is why, several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics and hybrid approaches. In this paper, we try to solve the graph coloring problem using a new approach based on the quantum inspired cuc...
متن کاملAn Ant Algorithm for the Graph Colouring Problem
This paper describes an ant algorithm that colours graphs in an e cient way. First, we describe the graph colouring problem and the ant algorithm. We also present some results and propose a simple generalisation of the algorithm that might allow its application to other assignment problems. Finally, a short study of the algorithm operators explains its performance and shows that it may be seen ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2008
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-008-0066-8